On queueing-inventory-location problems
نویسندگان
چکیده
Abstract A network of queueing-inventory systems is considered where the inventories are replenished by a common central server. Travel times for transport items send out from center and an adaptive dispatching regime to direct transportation towards locations with incorporated in model. The stationary distribution system product form explicitly given. An optimization procedure developed find given optimal location replenishment center. Optimization respect overall utilization resources measured total throughput systems.
منابع مشابه
Emergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...
متن کاملLOCATION PROBLEMS IN THE PRESENCE OF QUEUEING by SAMUEL
Determining the optimal location of facilities to serve a spatially disnersed set of customers has been an increasingly active research area during the past twenty years. Many systems whose facilities are to be located operate in a stochastic environment, with uncertainties associated with the arrival time, location and service requirements of each customer. Facilities having finite service cap...
متن کاملA realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm
In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...
متن کاملOn queueing problems in random-access communications
The general problem of allocating the capacity of a communication channel to a population of geographically distributed terminals is considered. The main focus is on the queueing problems that arise in the analysis of random access resolution algorithms. The performance measures of interest are the channel efficiency and the mean response time. The nature of known solutions for various random a...
متن کاملM/M/1 Queueing systems with inventory
We derive stationary distributions of joint queue length and inventory processes in explicit product form for various M/M/1-systems with inventory under continuous review and different inventory management policies, and with lost sales. Demand is Poisson, service times and lead times are exponentially distributed. These distributions are used to calculate performance measures of the respective ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2022
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-022-04839-5